On (5, ${k}_{1}$)--regular and totally (5, ${k}_{1}$) regular fuzzy grid

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generating 5-regular planar graphs

For k = 0, 1, 2, 3, 4, 5, let Pk be the class of k-edge-connected 5regular planar graphs. In this paper, graph operations are introduced that generate all graphs in each Pk. ∗Research partially supported by NSF grants DMS-0556091 and ITR-0326387. †Research partially supported by Board of Regents grant LEQSF(2004-07)-RD-A-22.

متن کامل

GENERALIZED REGULAR FUZZY MATRICES

In this paper, the concept of k-regular fuzzy matrix as a general- ization of regular matrix is introduced and some basic properties of a k-regular fuzzy matrix are derived. This leads to the characterization of a matrix for which the regularity index and the index are identical. Further the relation between regular, k-regular and regularity of powers of fuzzy matrices are dis- cussed.

متن کامل

5-chromatic Strongly Regular Graphs

In this paper, we begin the determination of all primitive strongly regular graphs with chromatic number equal to 5. Using eigenvalue techniques, we show that there are at most 43 possible parameter sets for such a graph. For each parameter set, we must decide which strongly regular graphs, if any, possessing the set are 5-chromatic. In this way, we deal completely with 34 of these parameter se...

متن کامل

Deterministic Fuzzy Automaton on Subclasses of Fuzzy Regular ω-Languages

In formal language theory, we are mainly interested in the natural language computational aspects of ω-languages. Therefore in this respect it is convenient to consider fuzzy ω-languages. In this paper, we introduce two subclasses of fuzzy regular ω-languages called fuzzy n-local ω-languages and Buchi fuzzy n-local ω-languages, and give some closure properties for those subclasses. We define a ...

متن کامل

On 4-cycles and 5-cycles in Regular Tournaments

First, some definitions. A tournament is regular of degree k if each point has indegree k and outdegree k: clearly such a tournament has 2k +1 points. The trivial tournament has just one point. A tournament T is doubly regular with subdegree t if it is non-trivial and any two points of T jointly dominate precisely t points; equivalently if T is non-trivial and for each point v of T, the subtour...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Malaya Journal of Matematik

سال: 2021

ISSN: 2319-3786,2321-5666

DOI: 10.26637/mjm0901/0102